A path or a map?

نویسنده

  • Steven D. Tripp
چکیده

My digital multifunction wristwatch is representative of a class of modern information machines. It has 51 functions controlled by four buttons, but the internal operations of the watch and the pattern of button-presses are obscure to the user. Providing useful instruction for the operation of such machines is notoriously difficult. Standard instructional design (ID) prescriptions for teaching procedures are not very helpful. ID typically conceives of procedures as a single string of events, i.e., a path. The watch interface is not a single procedure, but a collection of parallel procedures, each of which is minimally different from the others. This collection of procedures constitutes a tiny domain that could potentially be mapped. By mapping we refer to a representation at a more abstract level that enables multiple paths. A task-action grammar was written to represent the domain at an abstract level. A simulator was used to test hypotheses about different approaches to writing instruction for digital machines. Results indicated that instructional information at the map level produced more transfer to uninstructed tasks without sacrificing time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remainder Cordial Labeling of Graphs

In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...

متن کامل

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

متن کامل

The pattern of income distribution and wealth from the perspective of the Holy Quran

Abstract An optimal pattern is expected to simplify complex phenomena on a small scale. The pattern of income distribution and wealth from the perspective of the Holy Quran to the systematic set of foundations and infrastructures (such as the true ownership of God (his will) on existence, the substitution of man and the trustworthiness of property in his hands); goals (spirituality, justice ...

متن کامل

Quantitative Evaluation of the Exploration Strategies of a Mobile Robot

How should a mobile robot explore its environment in order to build a high-quality world model as efficiently as possible? We address this question through experimentation with a sonar-equipped mobile robot. The robot is taken to be a delivery robot, such as could be used in an office, hospital or home. Its objective is to execute efficient collision-free paths between user-specified locations....

متن کامل

Mind the Map! The Impact of Transit Maps on Travel Decisions in Public Transit

This paper investigates the impact of schematic transit maps on passengers’ travel decisions. It does two things: First, it proposes an analysis framework that defines four types of information conferred from a transit map: distortion, restoration, codification, and cognition, and their potential impact on three types of travel decisions: location, mode, and path choices. Second, it conducts an...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002